#include "Sort.h"



int main()
{
	//int arr[] = { 10,6,7,1,3,9,4,2 };
	int arr[] = { 9,1,2,5,7,4,6,3,5,9,1,2,5,7,4,6,3,5,9,1,2,5,7,4,6,3,5,9,1,2,5,7,4,6,3,5,9,1,2,5,7,4,6,3,5 };
	int sz = sizeof(arr) / sizeof(arr[0]);
	//InsertSort(arr, sz);
	//ShellSort(arr, sz);
	//SelectSort(arr, sz);
	//HeapSort(arr, sz);
	//BubbleSort(arr, sz);
	//QuickSort(arr, 0, sz - 1);
	//PartSort3Way(arr, 0, sz - 1);
	//QuickSortNonR(arr, 0, sz - 1);
	//MergeSort(arr,sz);
	//MergeSortNonR(arr, sz);
	CountSort(arr, sz);
	return 0;
}